A pursuit-evasion bibliography—Version 1

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pursuit-Evasion Toolkit

This tutorial contains tools and techniques for designing pursuit and evasion strategies. The material targets a diverse audience including STEM educators as well as robotics researchers interested in applications of pursuit-evasion games. We start with a simple “lion and man” game in a square environment which should be accessible to anyone with a high-school level background on geometry and t...

متن کامل

Multiple - Agent Probabilistic Pursuit - Evasion Games 1

In this paper we develop a probabilistic framework for pursuit-evasion games. We propose a \greedy" policy to control a swarm of autonomous agents in the pursuit of one or several evaders. At each instant of time this policy directs the pursuers to the locations that maximize the probability of nding an evader at that particular time instant. It is shown that, under mild assumptions, this polic...

متن کامل

Pursuit - Evasion Voronoi Diagrams in 1 ∗

We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader’s region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path...

متن کامل

A Pursuit-Evasion BUG Algorithm

We consider the problem of searching for an unpredictable moving target, using a robot that lacks a map of the environment, lacks the ability to construct a map, and has imperfect navigation ability. We present a complete algorithm, which yields a motion strategy for the robot that guarantees the elusive target will be detected, if such a strategy exists. It is assumed that the robot has an omn...

متن کامل

Pursuit- Evasion Games

Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1987

ISSN: 0898-1221

DOI: 10.1016/0898-1221(87)90110-6